Convex Geometry of Orbits

نویسندگان

  • ALEXANDER BARVINOK
  • GRIGORIY BLEKHERMAN
چکیده

We study metric properties of convex bodies B and their polars B, where B is the convex hull of an orbit under the action of a compact group G. Examples include the Traveling Salesman Polytope in polyhedral combinatorics (G = Sn, the symmetric group), the set of nonnegative polynomials in real algebraic geometry (G = SO(n), the special orthogonal group), and the convex hull of the Grassmannian and the unit comass ball in the theory of calibrated geometries (G = SO(n), but with a different action). We compute the radius of the largest ball contained in the symmetric Traveling Salesman Polytope, give a reasonably tight estimate for the radius of the Euclidean ball containing the unit comass ball and review (sometimes with simpler and unified proofs) recent results on the structure of the set of nonnegative polynomials (the radius of the inscribed ball, volume estimates, and relations to the sums of squares). Our main tool is a new simple description of the ellipsoid of the largest volume contained in B.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combinatorially Two-Orbit Convex Polytopes

Any convex polytope whose combinatorial automorphism group has two orbits on the flags is isomorphic to one whose group of Euclidean symmetries has two orbits on the flags (equivalently, to one whose automorphism group and symmetry group coincide). Hence, a combinatorially two-orbit convex polytope is isomorphic to one of a known finite list, all of which are 3-dimensional: the cuboctahedron, i...

متن کامل

Sweep Line Algorithm for Convex Hull Revisited

Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...

متن کامل

Three-periodic orbits on hyperbolic plane

Consider what is called the classical (Birkhoff) billiard problem: a particle moves in the planar convex domain D along the straight lines interacting with the boundary ∂D according to the Fermat’s law“ angle of reflection is equal to the angle of incidence”. In mathematical physics it is important to understand how many periodic orbits can be present in a planar billiard. Periodic orbits are t...

متن کامل

The Contact Polytope of the Leech Lattice

The contact polytope of a lattice is the convex hull of its shortest vectors. In this paper we classify the facets of the contact polytope of the Leech lattice up to symmetry. There are 1,197,362,269,604,214,277,200 many facets in 232 orbits.

متن کامل

SIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD

In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...

متن کامل

Convex Hulls of Orbits and Orientations of a Moving Protein Domain

We study the facial structure and Carathéodory number of the convex hull of an orbit of the group of rotations in R acting on the space of pairs of anisotropic symmetric 3× 3 tensors. This is motivated by the problem of determining the structure of some proteins in aqueous solution.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005